Algebras of multiplace functions for signatures containing antidomain

We define antidomain operations for algebras of multiplace partial functions. For all signatures containing composition, the antidomain operations and any subset of intersection, preferential union and fixset, we give finite equational or quasiequational axiomatisations for the representation class. We do the same for the question of representability by injective multiplace partial functions. For all our representation theorems, it is an immediate corollary of our proof that the finite representation property holds for the representation class. We show that for a large set of signatures, the representation classes have equational theories that are coNP-complete.Comment: 33 pages. Added brief discussion of square algebra

Disjoint-union partial algebras

Disjoint union is a partial binary operation returning the union of two sets if they are disjoint and undefined otherwise. A disjoint-union partial algebra of sets is a collection of sets closed under disjoint unions, whenever they are defined. We provide a recursive first-order axiomatisation of the class of partial algebras isomorphic to a disjoint-union partial algebra of sets but prove that no finite axiomatisation exists. We do the same for other signatures including one or both of disjoint union and subset complement, another partial binary operation we define. Domain-disjoint union is a partial binary operation on partial functions, returning the union if the arguments have disjoint domains and undefined otherwise. For each signature including one or both of domain-disjoint union and subset complement and optionally including composition, we consider the class of partial algebras isomorphic to a collection of partial functions closed under the operations. Again the classes prove to be axiomatisable, but not finitely axiomatisable, in first-order logic. We define the notion of pairwise combinability. For each of the previously considered signatures, we examine the class isomorphic to a partial algebra of sets/partial functions under an isomorphism mapping arbitrary suprema of pairwise combinable sets to the corresponding disjoint unions. We prove that for each case the class is not closed under elementary equivalence. However, when intersection is added to any of the signatures considered, the isomorphism class of the partial algebras of sets is finitely axiomatisable and in each case we give such an axiomatisation.Comment: 30 page

Free Kleene algebras with domain

First we identify the free algebras of the class of algebras of binary relations equipped with the composition and domain operations. Elements of the free algebras are pointed labelled finite rooted trees. Then we extend to the analogous case when the signature includes all the Kleene algebra with domain operations; that is, we add union and reflexive transitive closure to the signature. In this second case, elements of the free algebras are 'regular' sets of the trees of the first case. As a corollary, the axioms of domain semirings provide a finite quasiequational axiomatisation of the equational theory of algebras of binary relations for the intermediate signature of composition, union, and domain. Next we note that our regular sets of trees are not closed under complement, but prove that they are closed under intersection. Finally, we prove that under relational semantics the equational validities of Kleene algebras with domain form a decidable set.Comment: 22 pages. Some proofs expande

Difference-restriction algebras of partial functions with operators: discrete duality and completion

We exhibit an adjunction between a category of abstract algebras of partial functions and a category of set quotients. The algebras are those atomic algebras representable as a collection of partial functions closed under relative complement and domain restriction; the morphisms are the complete homomorphisms. This generalises the discrete adjunction between the atomic Boolean algebras and the category of sets. We define the compatible completion of a representable algebra, and show that the monad induced by our adjunction yields the compatible completion of any atomic representable algebra. As a corollary, the adjunction restricts to a duality on the compatibly complete atomic representable algebras, generalising the discrete duality between complete atomic Boolean algebras and sets. We then extend these adjunction, duality, and completion results to representable algebras equipped with arbitrary additional completely additive and compatibility preserving operators.Comment: 30 pages. Small improvements throughou

Difference-restriction algebras of partial functions: axiomatisations and representations

We investigate the representation and complete representation classes for algebras of partial functions with the signature of relative complement and domain restriction. We provide and prove the correctness of a finite equational axiomatisation for the class of algebras representable by partial functions. As a corollary, the same equations axiomatise the algebras representable as injective partial functions. For complete representations, we show that a representation is meet complete if and only if it is join complete. Then we show that the class of completely representable algebras is precisely the class of atomic and representable algebras. As a corollary, the same properties axiomatise the class of algebras completely representable by injective partial functions. The universal-existential-universal axiomatisation this yields for these complete representation classes is the simplest possible, in the sense that no existential-universal-existential axiomatisation exists.Comment: 28 page

Temporal Logic of Minkowski Spacetime

We present the proof that the temporal logic of two-dimensional Minkowski spacetime is decidable, PSPACE-complete. The proof is based on a type of two-dimensional mosaic. Then we present the modification of the proof so as to work for slower-than-light signals. Finally, a subframe of the slower-than-light Minkowski frame is used to prove the new result that the temporal logic of real intervals with during as the accessibility relation is also PSPACE-complete

The temporal logic of two-dimensional Minkowski spacetime with slower-than-light accessibility is decidable

We work primarily with the Kripke frame consisting of two-dimensional Minkowski spacetime with the irreflexive accessibility relation 'can reach with a slower-than-light signal'. We show that in the basic temporal language, the set of validities over this frame is decidable. We then refine this to PSPACE-complete. In both cases the same result for the corresponding reflexive frame follows immediately. With a little more work we obtain PSPACE-completeness for the validities of the Halpern-Shoham logic of intervals on the real line with two different combinations of modalities.Comment: 20 page

Algebras of partial functions

This thesis collects together four sets of results, produced by investigating modifications, in four distinct directions, of the following. Some set-theoretic operations on partial functions are chosen—composition and intersection are examples—and the class of algebras isomorphic to a collection of partial functions, equipped with those operations, is studied. Typical questions asked are whether the class is axiomatisable, or indeed finitely axiomatisable, in any fragment of first-order logic, what computational complexity classes its equational/quasiequational/first-order theories lie in, and whether it is decidable if a finite algebra is in the class. The first modification to the basic picture asks that the isomorphisms turn any existing suprema into unions and/or infima into intersections, and examines the class so obtained. For composition, intersection, and antidomain together, we show that the suprema and infima conditions are equivalent. We show the resulting class is axiomatisable by a universal-existential-universal sentence, but not axiomatisable by any existential-universal-existential theory. The second contribution concerns what happens when we demand partial functions on some finite base set. The finite representation property is essentially the assertion that this restriction that the base set be finite does not restrict the algebras themselves. For composition, intersection, domain, and range, plus many supersignatures, we prove the finite representation property. It follows that it is decidable whether a finite algebra is a member of the relevant class. The third set of results generalises from unary to ‘multiplace’ functions. For the signatures investigated, finite equational or quasiequational axiomatisations are obtained; similarly when the functions are constrained to be injective. The finite representation property follows. The equational theories are shown to be coNP-complete. In the last section we consider operations that may only be partial. For most signatures the relevant class is found to be recursively, but not finitely, axiomatisable. For others, finite axiomatisations are provided

The finite representation property for composition, intersection, domain and range

We prove that the nite representation property holds for rep- resentation by partial functions for the signature consisting of composition, intersection, domain and range and for any expansion of this signature by the antidomain, xset, preferential union, maximum iterate and opposite opera- tions. The proof shows that, for all these signatures, the size of base required is bounded by a double-exponential function of the size of the algebra. This establishes that representability of nite algebras is decidable for all these signatures. We also give an example of a signature for which the nite repre- sentation property fails to hold for representation by partial functions